The computation might be something mathematical, such as solving a system of equations or finding the roots of a polynomial, but it can also be a symbolic computation, such as searching and replacing text in a document or ( strangely enough ) compiling a program 運(yùn)算也許是一些數(shù)學(xué)的東西,比如求解一個(gè)方程組,或者是找到一個(gè)多項(xiàng)式的根;但也可能是一些符號(hào)化的東西,例如在一個(gè)文檔中查找替換一些文字或者編譯一個(gè)程序(盡管十分神奇)。
In this paper, the parallel algorithm for finding; matrices eigenvalue and its internal mechanism are thoroughly researched by situation of research at home and abroad . the matrices eigenvalue problem come down to the problem for solving roots of a polynomial, thereafter it is solved by circular arithmetic 本文在國(guó)內(nèi)外關(guān)于求矩陣特征值問(wèn)題的并行算法研究狀況的基礎(chǔ)上,對(duì)它們進(jìn)行了進(jìn)一步研究,探討了它們的內(nèi)部機(jī)理,將矩陣特征值問(wèn)題歸結(jié)為多項(xiàng)式求根問(wèn)題,然后用圓盤(pán)算術(shù)求解。